Holographic Transformation, Belief Propagation and Loop Calculus for Quantum Information Science

نویسنده

  • Ryuhei Mori
چکیده

Abstract—The holographic transformation is generalized to problems in quantum information science. In this work, the partition function is represented by an inner product of two highdimensional vectors both of which can be decomposed to tensor products of low-dimensional vectors. On the representation, the holographic transformation is clearly understood by using adjoint linear maps. Furthermore, for the general problem of computing the inner product, the belief propagation and the loop calculus formula are naturally defined and derived, respectively. Finally, an expression of weights in the loop calculus for problems in quantum information science is shown using concepts from quantum information geometry.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Holographic Transformation for Quantum Factor Graphs

—Recently, a general tool called a holographic transformation , which transforms an expression of the partition function to another form, has been used for polynomial-time algorithms and for improvement and understanding of the belief propagation. In this work, the holographic transformation is generalized to quantum factor graphs.

متن کامل

Loop Calculus in Statistical Physics and Information Science

Considering a discrete and finite statistical model of a general position we introduce an exact expression for the partition function in terms of a finite series. The leading term in the series is the Bethe-Peierls (belief propagation) (BP) contribution; the rest are expressed as loop contributions on the factor graph and calculated directly using the BP solution. The series unveils a small par...

متن کامل

Tree-structured Approximations by Expectation Propagation

Approximation structure plays an important role in inference on loopy graphs. As a tractable structure, tree approximations have been utilized in the variational method of Ghahramani & Jordan (1997) and the sequential projection method of Frey et al. (2000). However, belief propagation represents each factor of the graph with a product of single-node messages. In this paper, belief propagation ...

متن کامل

Belief Propagation and Loop Series on Planar Graphs

We discuss a generic model of Bayesian inference with binary variables defined on edges of a planar graph. The Loop Calculus approach of [1, 2] is used to evaluate the resulting series expansion for the partition function. We show that, for planar graphs, truncating the series at single-connected loops reduces, via a map reminiscent of the Fisher transformation [3], to evaluating the partition ...

متن کامل

Loopy annealing belief propagation for vertex cover and matching: convergence, LP relaxation, correctness and Bethe approximation

Abstract—For the minimum cardinality vertex cover and maximum cardinality matching problems, the max-product form of belief propagation (BP) is known to perform poorly on general graphs. In this paper, we present an iterative annealing BP algorithm which is shown to converge and to solve a Linear Programming relaxation of the vertex cover problem on general graphs. As a consequence, our anneali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1501.04183  شماره 

صفحات  -

تاریخ انتشار 2015